New Rules for Early Delivery in an Atomic Multicast System
نویسنده
چکیده
An atomic multicast facility guarantees that a multicast message is delivered to the multicast group, and that every process receives messages in the same order. The availability of an atomic multicast facility greatly simpliies the implementation of many distributed system functions. Atomic multicast can be built on top of a reliable causal multicast by waiting until each processor in the group has multicast a message, then delivering the roots of the causal DAG. However, this approach makes the system run at the speed of the slowest processor. Performance can be improved by permitting an early delivery of messages. Dolev, Malki, and Kramer gave a protocol, ToTo, for early delivery atomic multicast built on a reliable causal multicast. In this paper, we show that the ToTo protocol is more restrictive than it needs to be, and present a simpliication that improves performance. Next, we show how to extend the simpliied ToTo protocol to permit early delivery in a wider range of operating conditions. Finally, we discuss a simple method to deliver some of the multicast messages even earlier.
منابع مشابه
A New Method based on Intelligent Water Drops for Multicast Routing in Wireless Mesh Networks
In recent years a new type of wireless networks named wireless mesh networks has drawn the attention of researchers. In order to increase the capacity of mesh network, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi channel wireless mesh networks. Therefore, the main challenge of these networks is how to properly assign the channels to the radios. O...
متن کاملEarly-Delivery Dynamic Atomic Broadcast
We consider a problem of atomic broadcast in a dynamic setting where processes may join, leave voluntarily, or fail (by stopping) during the course of computation. We provide a formal definition of the Dynamic Atomic Broadcast problem and present and analyze a new algorithm for its solution in a variant of a synchronous model, where processes have approximately synchronized clocks. Our algorith...
متن کاملOn the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks
In this paper, we study the atomic broadcast and multicast problems, two fundamental abstractions for building fault-tolerant systems. As opposed to atomic broadcast, atomic multicast allows messages to be addressed to a subset of the processes in the system, each message possibly being multicast to a different subset. Our study focuses on wide area networks where groups of processes, i.e., pro...
متن کاملA High Performance Totally Ordered Multicast Protocol
This paper presents the Reliable Multicast Protocol (RMP). RMP provides a totally ordered, reliable, atomic multicast service on top of an unreliable multicast datagram service such as IP Multicasting. RMP is fully and symmetrically distributed so that no site bears an undue portion of the communication load. RMP provides a wide range of guarantees, from unreliable delivery to totally ordered d...
متن کاملRow/Column-First: A Path-based Multicast Algorithm for 2D Mesh-based Network on Chips
In this paper, we propose a new path-based multicast algorithm that is called Row/Column-First algorithm. The proposed algorithm constructs a set of multicast paths to deliver a multicast message to all multicast destination nodes. The set of multicast paths are all of row-first or column-first subcategories to maximize the multicast performance. The selection of row-first or column-first appro...
متن کامل